Balanced Cayley graphs and balanced planar graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Balanced Cayley graphs and balanced planar graphs

A balanced graph is a bipartite graph with no induced circuit of length 2 (mod 4). These graphs arise in linear programming. We focus on graph-algebraic properties of balanced graphs to prove a complete classification of balanced Cayley graphs on abelian groups. Moreover, in Section 5 of this paper, we prove that there is no cubic balanced planar graph. Finally, some remarkable conjectures for ...

متن کامل

Remarks on Distance-Balanced Graphs

Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.

متن کامل

Regular maps from Cayley graphs, part 1: Balanced Cayley maps

Skoviera, M. and J. ‘&Iii, Regular maps from Cayley graphs, Part i: Balanced Cayley maps, Discrete Mathematics IO9 (1992) 265-276. A Cayley map is a Cayley graph 2-cell embedded in some orientable surface so that the local rotations at every vertex are identical. Two types of Cayley maps are introduced: the balanced and antibalanced Cayley maps. In Part 1, conditions are given uuder which a bal...

متن کامل

Balanced Circle Packings for Planar Graphs

We study balanced circle packings and circle-contact representations for planar graphs, where the ratio of the largest circle’s diameter to the smallest circle’s diameter is polynomial in the number of circles. We provide a number of positive and negative results for the existence of such balanced configurations.

متن کامل

Distance-Balanced Closure of Some Graphs

In this paper we prove that any distance-balanced graph $G$ with $Delta(G)geq |V(G)|-3$ is regular. Also we define notion of distance-balanced closure of a graph and we find distance-balanced closures of trees $T$ with $Delta(T)geq |V(T)|-3$.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2010

ISSN: 0012-365X

DOI: 10.1016/j.disc.2009.11.002